Edge Weight Reduction Problems in Directed Acyclic Graphs
نویسندگان
چکیده
منابع مشابه
Edge Weight Reduction Problems in Directed Acyclic Graphs
Let G be a weighted, direr.ted, acyclic graph in which each edge weight. is not a staticquantity, but can be reduced for a certain cost. In this paper we consider the problem of determining which edg('s to reduce so that the length of the longest paths is minimized and the total cost associated with the reductions does not exceed a given cost. We consider two type-s of edge reductions, linear r...
متن کاملDirected acyclic graphs with edge-specific bounds.
We give a definition of a bounded edge within the causal directed acyclic graph framework. A bounded edge generalizes the notion of a signed edge and is defined in terms of bounds on a ratio of survivor probabilities. We derive rules concerning the propagation of bounds. Bounds on causal effects in the presence of unmeasured confounding are also derived using bounds related to specific edges on...
متن کاملSteiner Problems on Directed Acyclic Graphs
In this paper we consider two variations of the minimum cost Steiner problem on a directed acyclic graph G V E with a non negative weight on each edge of E The minimum directed Steiner network problem is de ned as follows Given a set of starting vertices S V and a set of terminating vertices T V nd a subgraph with the minimum total edge weight such that for each starting vertex s there exists a...
متن کاملParameterized Tractability of Edge-Disjoint Paths on Directed Acyclic Graphs
Given a graph and pairs siti of terminals, the edge-disjoint paths problem is to determine whether there exist siti paths that do not share any edges. We consider this problem on acyclic digraphs. It is known to be NP-complete and solvable in time n where k is the number of paths. It has been a long-standing open question whether it is fixed-parameter tractable in k. We resolve this question in...
متن کاملNew common ancestor problems in trees and directed acyclic graphs
We derive a new generalization of lowest common ancestors (LCAs) in dags, called the lowest single common ancestor (LSCA). We show how to preprocess a static dag in linear time such that subsequent LSCA-queries can be answered in constant time. The size is linear in the number of nodes. We also consider a “fuzzy” variant of LSCA that allows to compute a node that is only an LSCA of a given perc...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Journal of Algorithms
سال: 1997
ISSN: 0196-6774
DOI: 10.1006/jagm.1997.0856